Detecting looping simplifications
Identifieur interne : 00E622 ( Main/Exploration ); précédent : 00E621; suivant : 00E623Detecting looping simplifications
Auteurs : Paul Walton Purdom Jr. [États-Unis]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: A generalization of tree matching and unification algorithms is presented. Given the equation s=t, this algorithm can often quickly determine that the rewrite rule s→t leads to an infinite sequence of “simplifications”. The rule t→s can be tested in the same way. Rules leading to infinite simplifications should not be included in a rewrite system. In general, the problem of deciding whether a set of rewrite rules leads to infinite simplifications is undecidable. The algorithm that is used for this problem is a cross between a unification algorithm for terms with overlapping variables and a matching algorithm. In the simplest case it attempts to find α, σ M and σ U such that σ M σ U =σ U t/a. In other words, is there a substitution σ U such that in the rule σ U s→σ U t the left side matches a subpart of the right side. The same basic algorithm can be used to test more complex cases of looping involving the interaction of several rules, but it is limited to those cases where each application of a rule occurs inside of the previous rule application. Experiments suggest that the simplest form of the algorithm is about 80 percent effective in eliminating bad orientations of rules. The algorithm never rules out a good orientation of a rule, and so it is most useful when one wants to consider all possible rule orientations.
Url:
DOI: 10.1007/3-540-17220-3_5
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 003203
- to stream Istex, to step Curation: 003163
- to stream Istex, to step Checkpoint: 003551
- to stream Main, to step Merge: 00EF09
- to stream Main, to step Curation: 00E622
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Detecting looping simplifications</title><author><name sortKey="Purdom Jr, Paul Walton" sort="Purdom Jr, Paul Walton" uniqKey="Purdom Jr P" first="Paul Walton" last="Purdom Jr.">Paul Walton Purdom Jr.</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:D21CBCC16EA55C2D92927DA98CD180E361ACF0A8</idno><date when="1987" year="1987">1987</date><idno type="doi">10.1007/3-540-17220-3_5</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-SBH45PQ7-9/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">003203</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003203</idno><idno type="wicri:Area/Istex/Curation">003163</idno><idno type="wicri:Area/Istex/Checkpoint">003551</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">003551</idno><idno type="wicri:doubleKey">0302-9743:1987:Purdom Jr P:detecting:looping:simplifications</idno><idno type="wicri:Area/Main/Merge">00EF09</idno><idno type="wicri:Area/Main/Curation">00E622</idno><idno type="wicri:Area/Main/Exploration">00E622</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Detecting looping simplifications</title><author><name sortKey="Purdom Jr, Paul Walton" sort="Purdom Jr, Paul Walton" uniqKey="Purdom Jr P" first="Paul Walton" last="Purdom Jr.">Paul Walton Purdom Jr.</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><wicri:regionArea>Indiana University, 101 Lindley, Computer Science, 47401, Bloomington, Indiana</wicri:regionArea><placeName><region type="state">Indiana</region></placeName></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><title level="s" type="abbrev">Lect Notes Comput Sci</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: A generalization of tree matching and unification algorithms is presented. Given the equation s=t, this algorithm can often quickly determine that the rewrite rule s→t leads to an infinite sequence of “simplifications”. The rule t→s can be tested in the same way. Rules leading to infinite simplifications should not be included in a rewrite system. In general, the problem of deciding whether a set of rewrite rules leads to infinite simplifications is undecidable. The algorithm that is used for this problem is a cross between a unification algorithm for terms with overlapping variables and a matching algorithm. In the simplest case it attempts to find α, σ M and σ U such that σ M σ U =σ U t/a. In other words, is there a substitution σ U such that in the rule σ U s→σ U t the left side matches a subpart of the right side. The same basic algorithm can be used to test more complex cases of looping involving the interaction of several rules, but it is limited to those cases where each application of a rule occurs inside of the previous rule application. Experiments suggest that the simplest form of the algorithm is about 80 percent effective in eliminating bad orientations of rules. The algorithm never rules out a good orientation of a rule, and so it is most useful when one wants to consider all possible rule orientations.</div></front></TEI><affiliations><list><country><li>États-Unis</li></country><region><li>Indiana</li></region></list><tree><country name="États-Unis"><region name="Indiana"><name sortKey="Purdom Jr, Paul Walton" sort="Purdom Jr, Paul Walton" uniqKey="Purdom Jr P" first="Paul Walton" last="Purdom Jr.">Paul Walton Purdom Jr.</name></region></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00E622 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00E622 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:D21CBCC16EA55C2D92927DA98CD180E361ACF0A8
|texte= Detecting looping simplifications
}}
| This area was generated with Dilib version V0.6.33. |  |